#pragma GCC optimize(2)
#include <iostream>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <unordered_set>
#include <bitset>
#define F first
#define S second
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;

void solve()
{
	int a,b,c;
	cin>>a>>b>>c;
	int c1=(c+1)/2;
	int c2=c-c1;
	if(c1==c2)
	{
		if(a>b) cout<<"First";
		else cout<<"Second";
	}
	else
	{
		if(a>=b) cout<<"First";
		else cout<<"Second";
	}
	cout<<endl;
}
int main()
{
	IOS;
	int T=1;
	cin>>T;

	while(T--)
	{
		solve();
	}

	return 0;
}

